Constraint Propagation vs Syntactical
نویسنده
چکیده
This paper describes a constraint propagation method for logical structure extraction of Library references without the use of ocr. The accent is put on the search of anchor points from visual indices extraction. A mixed strategy is performed. For each anchor points. the system proposes in a bottom-up manner the most probable model hypothesis and tries to verify in a top-down manner its left and right contexts .
منابع مشابه
Adaptive Solving of Equations over Rational Trees
Two variants of an incremental and adaptive uniication algorithm are presented. Both variants decide incrementally the consistency of conjunctions of syntactical equations over rational trees after any additions or deletions of syntactical equations. In the positive case, a rational solved form equivalent to the given conjunction is computed incrementally. Contrary to other incremental implemen...
متن کاملPropagation of Constraints along Model Transformations Based on Triple Graph Grammars
Model transformations based on triple graph grammars (TGGs) have been applied in several practical case studies and they convince by their intuitive and descriptive way of specifying bidirectional model transformations. Moreover, fundamental properties have been extensively studied including syntactical correctness, completeness, termination and functional behaviour. But up to now, it is an ope...
متن کاملToward Observational Equivalences for Linear Logic Concurrent Constraint Languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کاملObservational equivalences for linear logic concurrent constraint languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کاملOptimizing in vitro propagation of Rosa persica
Rosa persica with a distinctive red eye is a good candidate for addition to the breeding pool of roses. In order to optimize micropropagation of R. persica, three culture media (MS, QL and VS) were compared. The maximum growth rate was observed in the VS medium. Addition of FeEDTA (Fe: 65.4 mg/l), calcium gluconate (Cg: 2.7 g/l) and Gamborg vitamins (B5) instead of VS vitamins, alone or in comb...
متن کامل